class Solution {
    public int calculateMinimumHP(int[][] dungeon) {
        //1.创建dp表
        int m = dungeon.length;
        int n = dungeon[0].length;
        int[][] dp = new int[m+1][n+1];

        //2.初始化
        for(int row = 0; row < m+1; row++) {
            dp[row][n] = Integer.MAX_VALUE;
        }
        for(int col = 0; col < n+1; col++) {
            dp[m][col] = Integer.MAX_VALUE;
        }
        dp[m][n-1] = 1;

        //3.填表
        for(int i = m-1; i >= 0; i--) {
            for(int j = n-1; j >= 0; j--) {
                dp[i][j] = Math.min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j];
                dp[i][j] = Math.max(1, dp[i][j]);
            }
        }
        //4.返回值
        return dp[0][0];
    }
}